Subset Selection Via Implicit Utilitarian Voting
نویسندگان
چکیده
منابع مشابه
Subset Selection via Implicit Utilitarian Voting
How should one aggregate ordinal preferences expressed by voters into a measurably superior social choice? A well-established approach — which we refer to as implicit utilitarian voting — assumes that voters have latent utility functions that induce the reported rankings, and seeks voting rules that approximately maximize utilitarian social welfare. We extend this approach to the design of rule...
متن کاملThe Case for Utilitarian Voting
Utilitarian voting (UV) is defined in this paper as any voting rule that allows the voter to rank all of the alternatives by means of the scores permitted under a given voting scale. Specific UV rules that have been proposed are approval voting, allowing the scores 0, 1; range voting, allowing all numbers in an interval as scores; evaluative voting, allowing the scores -1, 0, 1. The paper deals...
متن کاملClaude Hillinger: Utilitarian Collective Choice and Voting
In his seminal Social Choice and Individual Values, Kenneth Arrow stated that his theory applies to voting. Many voting theorists have been convinced that, on account of Arrow’s theorem, all voting methods must be seriously flawed. Arrow’s theory is strictly ordinal, the cardinal aggregation of preferences being explicitly rejected. In this paper I point out that all voting methods are cardinal...
متن کاملClaude Hillinger: The Case for Utilitarian Voting
Utilitarian voting (UV) is defined in this paper as any voting rule that allows the voter to rank all of the alternatives by means of the scores permitted under a given voting scale. Specific UV rules that have been proposed are approval voting, allowing the scores 0, 1; range voting, allowing all numbers in an interval as scores; evaluative voting, allowing the scores -1, 0, 1. The paper deals...
متن کاملSubset ARMA selection via the adaptive Lasso
Model selection is a critical aspect of subset autoregressive moving-average (ARMA) modelling. This is commonly done by subset selection methods, which may be computationally intensive and even impractical when the true ARMA orders of the underlying model are high. On the other hand, automatic variable selection methods based on regularization do not directly apply to this problem because the i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2017
ISSN: 1076-9757
DOI: 10.1613/jair.5282